A Quantized Johnson Lindenstrauss Lemma: The Finding of Buffon's Needle
نویسنده
چکیده
In 1733, Georges-Louis Leclerc, Comte de Buffon in France, set the ground of geometric probability theory by defining an enlightening problem: What is the probability that a needle thrown randomly on a ground made of equispaced parallel strips lies on two of them? In this work, we show that the solution to this problem, and its generalization to N dimensions, allows us to discover a quantized form of the Johnson-Lindenstrauss (JL) Lemma, i.e., one that combines a linear dimensionality reduction procedure with a uniform quantization of precision δ > 0. In particular, given a finite set S ⊂ R of S points and a distortion level > 0, as soon as M > M0 = O( −2 logS), we can (randomly) construct a mapping from (S, `2) to ( (δ Z) , `1) that approximately preserves the pairwise distances between the points of S. Interestingly, compared to the common JL Lemma, the mapping is quasi-isometric and we observe both an additive and a multiplicative distortions on the embedded distances. These two distortions, however, decay as O( √ logS/M) when M increases. Moreover, for coarse quantization, i.e., for high δ compared to the set radius, the distortion is mainly additive, while for small δ we tend to a Lipschitz isometric embedding. Finally, we show that there exists “almost” a quasi-isometric embedding of (S, `2) in ((δZ) , `2). This one involves a non-linear distortion of the `2-distance in S that vanishes for distant points in this set. Noticeably, the additive distortion in this case is slower and decays as O((logS/M)).
منابع مشابه
236779: Foundations of Algorithms for Massive Datasets Lecture 4 the Johnson-lindenstrauss Lemma
The Johnson-Lindenstrauss lemma and its proof This lecture aims to prove the Johnson–Lindenstrauss lemma. Since the lemma is proved easily with another interesting lemma, a part of this lecture is focused on the proof of this second lemma. At the end, the optimality of the Johnson–Lindenstrauss lemma is discussed. Lemma 1 (Johnson-Lindenstrauss). Given the initial space X ⊆ R n s.t. |X| = N , <...
متن کاملJohnson-lindenstrauss Transformation and Random Projection
We give a brief survey of Johnson-Lindenstrauss lemma. CONTENTS
متن کاملAn Elementary Proof of the Johnson-lindenstrauss Lemma
The Johnson-Lindenstrauss lemma shows that a set of n points in high dimensional Euclidean space can be mapped down into an O(log n== 2) dimensional Euclidean space such that the distance between any two points changes by only a factor of (1). In this note, we prove this lemma using elementary probabilistic techniques.
متن کاملThe Johnson-Lindenstrauss Lemma Meets Compressed Sensing
We show how two fundamental results in analysis related to n-widths and Compressed Sensing are intimately related to the Johnson-Lindenstrauss lemma. Our elementary approach is based on the same concentration inequalities for random inner products that have recently provided simple proofs of the Johnson-Lindenstrauss lemma. We show how these ideas lead to simple proofs of Kashin’s theorems on w...
متن کاملGeometric Optimization April 12 , 2007 Lecture 25 : Johnson Lindenstrauss Lemma
The topic of this lecture is dimensionality reduction. Many problems have been efficiently solved in low dimensions, but very often the solution to low-dimensional spaces are impractical for high dimensional spaces because either space or running time is exponential in dimension. In order to address the curse of dimensionality, one technique is to map a set of points in a high dimensional space...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 61 شماره
صفحات -
تاریخ انتشار 2015